A geometric index reduction method for implicit systems of differential algebraic equations
نویسندگان
چکیده
منابع مشابه
A Geometric Index Reduction Method for Implicit Systems of Differential Algebraic Equations
This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely algebraic (polynomial) equation plus an under-determined ODE (that is, a semi-explicit DAE system of differentiation index 1) in as many variables as the order of th...
متن کاملIndex reduction of differential algebraic equations by differential algebraic elimination
High index differential algebraic equations (DAEs) are ordinary differential equations (ODEs) with constraints and arise frequently from many mathematical models of physical phenomenons and engineering fields. In this paper, we generalize the idea of differential elimination with Dixon resultant to polynomially nonlinear DAEs. We propose a new algorithm for index reduction of DAEs and establish...
متن کاملA Shooting Method for Fully Implicit Index-2 Differential Algebraic Equations
A shooting method for two{point{boundary value problems for fully implicit index{ 1 and {2 diierential{algebraic equations is presented. A combination of the shooting equations with a method of the calculation of consistent initial values leads to a system of nonlinear algebraic equations with nonsingular Jacobian. Examples are given.
متن کاملIndex reduction for differential-algebraic equations by minimal extension
In this paper a new index reduction technique is discussed for the treatment of differential-algebraic systems for which extra structural information is available. Based on this information reduced derivative arrays are formed and instead of using expensive subspace computations the index reduction is obtained by introducing new variables. The new approach is demonstrated for several important ...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.05.012